Partial correctness: The term-wise approach
نویسندگان
چکیده
منابع مشابه
5.2 Partial Correctness
Finally, let us calculate the bit complexity required by the algorithm. The longest messages sent by the algorithm are vectors of n values. Regarding each entry as a separate variable (since, in two of the cases, overlap and reading, they are written by diierent readers), a simple application of Lemma 7 implies that the longest message requires O(n 4). However, we can note that, in response to ...
متن کاملMathematical theory of partial correctness
In this work we show that it is possible to express most properties regularly observed in algorithms in terms of 'partial correctness' (i.e., the property that the final results of the algorithm, if any, satism some given input-output relation). This result is of special interest since 'partial correctness 1 has already been formulated in predicate calculus and in partial function logic for man...
متن کاملPartial, Total and General Correctness
We identify weak semirings, which drop the right annihilation axiom a0 = 0, as a common foundation for partial, total and general correctness. It is known how to extend weak semirings by operations for finite and infinite iteration and domain. We use the resulting weak omega algebras with domain to define a semantics of while-programs which is valid in all three correctness approaches. The unif...
متن کاملModal Kleene Algebra and Partial Correctness
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions give rise to four modal operators. The boxes and diamonds enjoy various symmetries via Galois connections and dualities. Lifting modal statements to modal operator semirings yields a further abstraction and thus a more elegant and concise “statefree” reasoning about modalities. We use this modal ...
متن کاملPartial correctness for probabilistic demonic programs
Recent work in sequential program semantics has produced both an operational (He et al., Sci. Comput. Programming 28(2, 3) (1997) 171–192) and an axiomatic (Morgan et al., ACM Trans. Programming Languages Systems 18(3) (1996) 325–353; Seidel et al., Tech Report PRG-TR-6-96, Programming Research group, February 1996) treatment of total correctness for probabilistic demonic programs, extending Ko...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1984
ISSN: 0167-6423
DOI: 10.1016/0167-6423(84)90017-0